Code Bloat Problem in Genetic Programming
نویسندگان
چکیده
The concept of “bloat” in Genetic Programming is a well-established phenomenon characterized by variable-length genomes gradually increasing in size during evolution [1]. Bloat hampers the efficiency and ability of genetic programming for solving problems. A range of explanations have been proposed for the problem of bloat, including destructive crossover and mutation operators, selection pressure and individual representation. Different methods to avoid bloat and to control bloat have been proposed by researchers. This paper proposes a theoretical analysis of code bloating problem and the discussion on the work already done by various authors to handle bloat in genetic programming.
منابع مشابه
The Root Causes of Code Growth in Genetic Programming
This paper discusses the underlying pressures responsible for code growth in genetic programming, and shows how an understanding of these pressures can be used to use to eliminate code growth while simultaneously improving performance. We begin with a discussion of two distinct components of code growth and the extent to which each component is relevant in practice. We then define the concept o...
متن کاملGenetic Programming Bloat without Semantics
To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype). GP populations are evolved on both random problems and problems with “building blocks”. These are compared to problems with explicit ineffective code (introns, junk code, inviable code). Our results suggest the entr...
متن کاملSize Control Via Size Fair Genetic Operators In The PushGP Genetic Programming System
The growth of program size during evolution (code “bloat”) is a well-documented and well-studied problem in genetic programming. This paper examines the use of “size fair” genetic operators to combat code bloat in the PushGP genetic programming system. Size fair operators are compared to naive operators and to operators that use “node selection” as described by Koza. The effects of the operator...
متن کاملUniversal Consistency and Bloat in GP Some theoretical considerations about Genetic Programming from a Statistical Learning Theory viewpoint
In this paper, we provide an analysis of Genetic Programming (GP) from the Statistical Learning Theory viewpoint in the scope of symbolic regression. Firstly, we are interested in Universal Consistency, i.e. the fact that the solution minimizing the empirical error does converge to the best possible error when the number of examples goes to infinity, and secondly, we focus our attention on the ...
متن کاملControlling Code Growth in Genetic Programming
It has been known since the early days of Genetic Programming that the evolutionary process tends to stagnate after a certain number of generations. Furthermore, during the evolutionary process, there is an inexorable and sometimes exponential increase in the average size of programs in a population. This has been called bloat. The major cause of this bloat appears to be caused by introns secti...
متن کامل